Injectivity and surjectivity of parallel maps for cellular automata
نویسندگان
چکیده
منابع مشابه
Approximate Maps Characterizing Injectivity and Surjectivity of Maps
In the theory of inverse systems, in order to study the properties of a space X or a map f : X → Y between spaces, one expands X to an inverse system X or expands f to a map f : X → Y between the inverse systems, and then work on X or f . In this paper, we define approximate injectivity (resp., surjectivity) for approximate maps, and show that a map f : X → Y between compact metric spaces is in...
متن کاملInverse and Injectivity of Parallel Relations Induced by Cellular Automata
Moore and Myhill showed that Garden-of-Eden theorem [2], [3]. A binary relation over the configurations is said to be "parallel" if it is induced by a cellular (tessellation) automaton. Richardson showed the equivalence between a parallel relation (a nondeterministic parallel map) with the quiescent state to be injective and its inverse to be parallel by the Garden-of-Eden theorem plus compactn...
متن کاملOne-Dimensional Cellular Automata: Injectivity From Unambiguity
New algorithms for deciding the injectivit y of the global update funct ion associat ed with a cellular automaton C A of dimension one are presented. This is done by interpreting each ordered pair dete rmined by the local update function as th e edge of a labeled directed graph GR which has the prope rty that each bi-infinite sequence of states of the cellular automaton is th e sequence of inpu...
متن کاملPost-surjectivity and balancedness of cellular automata over groups
We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every preimage of one is asymptotic to a preimage of the other. The well known dual concept is pre-injectivity: a cellular automaton is pre-injective if distinct asymptotic configurations have distinct images. We prove that pre-injecti...
متن کاملBI-OBJECTIVE OPTIMIZATION OF RESERVOIR OPERATION BY MULTI-STEP PARALLEL CELLULAR AUTOMATA
Parallel Cellular Automata (PCA) previously has been employed for optimizing bi-objective reservoir operation, where one release is used to meet both objectives. However, if a single release can only be used for one objective, meaning two separate sets of releases are needed, the method is not applicable anymore. In this paper, Multi-Step Parallel Cellular Automata (MSPCA) has been developed fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1979
ISSN: 0022-0000
DOI: 10.1016/0022-0000(79)90051-5